Orders with One Iterative Characteristic Orders with One Iterative Characteristic

نویسندگان

  • Kwangjo Kim
  • Sangjun Park
  • Sangjin Lee
چکیده

Table 6: The best orders of the S-boxes (p = 2 ?48). 6 Appendix This appendix describes 136 orders of DES S-boxes for which the maximal probability of two-round iterative characteristics is as in DES or smaller. Table 6 describes the orders whose best characteristics have probability 2 ?48 , which is lower than the best characteristic of DES. Table 7 describes the orders whose best characteristics have the same probability as the best characteristic of DES. In both tables, orders which have two characteristics with the same highest probability are listed separately. The italicized digits specify active S-boxes of the best characteristic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Data Encryption Standard ( DES ) and its

Table 6: The best orders of the S-boxes (p = 2 ?48). 6 Appendix This appendix describes 136 orders of DES S-boxes for which the maximal probability of two-round iterative characteristics is as in DES or smaller. Table 6 describes the orders whose best characteristics have probability 2 ?48 , which is lower than the best characteristic of DES. Table 7 describes the orders whose best characterist...

متن کامل

One-for-One Period Policy and its Optimal Solution

In this paper we introduce the optimal solution for a simple and yet practical inventory policy with the important characteristic which eliminates the uncertainty in demand for suppliers. In this new policy which is different from the classical inventory policies, the time interval between any two consecutive orders is fixed and the quantity of each order is one. Assuming the fixed ordering cos...

متن کامل

Time Domain Methods for the Calculation of Harmonic Propagation and Distortion

Numerical methods for the computation of harmonic propagation and distortion differ in the manner in which they represent the harmonic sources and the system impedance. Iterative methods (e.g. harmonic load flow) use a phasor representation of these parameters. Time domain methods, on the other hand, use a time representation of the system elements and the harmonic sources. Thus, they are gener...

متن کامل

Two new three and four parametric with memory methods for solving nonlinear ‎equations

In this study, based on the optimal free derivative without memory methods proposed by Cordero et al. [A. Cordero, J.L. Hueso, E. Martinez, J.R. Torregrosa, Generating optimal derivative free iterative methods for nonlinear equations by using polynomial interpolation, Mathematical and Computer Modeling. 57 (2013) 1950-1956], we develop two new iterative with memory methods for solving a nonline...

متن کامل

Galois Theory for Iterative Connections and Nonreduced Galois Groups

This article presents a theory of modules with iterative connection. This theory is a generalisation of the theory of modules with connection in characteristic zero to modules over rings of arbitrary characteristic. We show that these modules with iterative connection (and also the modules with integrable iterative connection) form a Tannakian category, assuming some nice properties for the und...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994